a simulated annealing algorithm for multi objective flexible job shop scheduling with overlapping in operations

Authors

mehrzad abdi khalife

babak abbasi

amirhossein kamali dolat abadi

abstract

in this paper, we considered solving approaches to flexible job shop problems. makespan is not a good evaluation criterion with overlapping in operations assumption. accordingly, in addition to makespan, we used total machine work loading time and critical machine work loading time as evaluation criteria. as overlapping in operations is a practical assumption in chemical, petrochemical, and glass industries, we used simulated annealing algorithm for multi-objective flexible job shop scheduling problem with overlapping in operations to find a suitable solution. to evaluate performance of the algorithm, we developed a mixed integer linear programming model, and solved it with the classical method (branch and bound). the results showed that in small size problems, the solutions of the proposed algorithm and the mathematical model were so close, and in medium size problems, they only had lower and upper bounds of solution and our proposed algorithm had a suitable solution. we used an experimental design for improving the proposed algorithm.

Upgrade to premium to download articles

Sign up to access the full text

Already have an account?login

similar resources

A Simulated Annealing Algorithm for Multi Objective Flexible Job Shop Scheduling with Overlapping in Operations

In this paper, we considered solving approaches to flexible job shop problems. Makespan is not a good evaluation criterion with overlapping in operations assumption. Accordingly, in addition to makespan, we used total machine work loading time and critical machine work loading time as evaluation criteria. As overlapping in operations is a practical assumption in chemical, petrochemical, and gla...

full text

Solving Flexible Job Shop Scheduling with Multi Objective Approach

  In this paper flexible job-shop scheduling problem (FJSP) is studied in the case of optimizing different contradictory objectives consisting of: (1) minimizing makespan, (2) minimizing total workload, and (3) minimizing workload of the most loaded machine. As the problem belongs to the class of NP-Hard problems, a new hybrid genetic algorithm is proposed to obtain a large set of Pareto-optima...

full text

A Hybrid Multi Objective Algorithm for Flexible Job Shop Scheduling

Scheduling for the flexible job shop is very important in both fields of production management and combinatorial optimization. However, it quit difficult to achieve an optimal solution to this problem with traditional optimization approaches owing to the high computational complexity. The combining of several optimization criteria induces additional complexity and new problems. In this paper, a...

full text

An algorithm for multi-objective job shop scheduling problem

Scheduling for job shop is very important in both fields of production management and combinatorial op-timization. However, it is quite difficult to achieve an optimal solution to this problem with traditional opti-mization approaches owing to the high computational complexity. The combination of several optimization criteria induces additional complexity and new problems. In this paper, we pro...

full text

an algorithm for multi-objective job shop scheduling problem

scheduling for job shop is very important in both fields of production management and combinatorial op-timization. however, it is quite difficult to achieve an optimal solution to this problem with traditional opti-mization approaches owing to the high computational complexity. the combination of several optimization criteria induces additional complexity and new problems. in this paper, we pro...

full text

َA Multi-objective simulated annealing algorithm to solving flexible no-wait flowshop scheduling problems with transportation times

This paper deals with a bi-objective hybrid no-wait flowshop scheduling problem minimizing the makespan and total weighted tardiness, in which we consider transportation times between stages. Obtaining an optimal solution for this type of complex, large-sized problem in reasonable computational time by using traditional approaches and optimization tools is extremely difficult. This paper presen...

full text

My Resources

Save resource for easier access later


Journal title:
journal of optimization in industrial engineering

Publisher: qiau

ISSN 2251-9904

volume Volume 3

issue Issue 5 2010

Hosted on Doprax cloud platform doprax.com

copyright © 2015-2023